Full Abstraction for Pcf ? (extended Abstract)
نویسنده
چکیده
منابع مشابه
Full Abstraction and the Context Lemma 1
It is impossible to add a combinator to PCF to achieve full abstraction for models such asBerry's stable domains in a way analogous to the addition of the \parallel-or" combinatorthat achieves full abstraction for the familiar cpo model. In particular, we de ne a generalnotion of rewriting system of the kind used for evaluating simply typed -terms in Scott'sPCF. Any simply t...
متن کاملFull abstraction for a Linear PCF
We study S PCF , namely a Turing-complete programming language inspired by a semantic notion of linearity. S PCF is based on a linear core of PCF and some operators providing basic primitives related to exception handling and nondeterministic evaluation. We show that S PCF is fully abstract for a linear model in the category of coherence spaces and linear functions, giving a cogent evidence of ...
متن کاملFull abstraction, totality and PCF
Inspired by a question of Riecke, we consider the interaction of totality and full abstraction, asking whether full abstraction holds for Scott’s model of cpos and continuous functions if one restricts to total programs and total observations. The answer is negative, as there are distinct operational and denotational notions of totality. However, when two terms are each total in both senses the...
متن کاملA fully abstract model for sequential computation
In 1977, G. Plotkin pointed out the problem of finding a fully abstract model for the sequential programming language PCF [16], which had been originally developed by D. Scott [19]. This question turned out to be one of the most enduring problems of semantics. A very nice description of the different approaches to this subject with many references can be found in [5]. In this rather brief overv...
متن کاملFinitary PCF is not decidable
The question of the decidability of the observational ordering of finitary PCF was raised [5] to give mathematical content to the full abstraction problem for PCF [9, 14]. We show that the ordering is in fact undecidable. This result places limits on how explicit a representation of the fully abstract model can be. It also gives a slight strengthening of the author’s earlier result on typed λ-d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994